An Improved Sparrow Search Algorithm for Optimizing Support Vector Machines

نویسندگان

چکیده

Support Vector Machine (SVM) is often used in regression and classification problems. However, SVM needs to find proper kernel function solve high-dimensional We propose an improved Sparrow Search Algorithm (ISSA-SVM) algorithm optimize the parameters. First, problem of slow convergence due lack ergodicity poor diversity initial population effectively overcome by using Sine chaotic map. Second, adaptive dynamic weight factors are induced not only balance global local search capabilities, but also accelerate speed sparrow algorithm. The simulation results 11 benchmark test functions show that ISSA has faster convergence, more accurate capability, easier jump out extremes than SSA, Gray Wolf Optimization (GWO) Whale (WOA). That indicates better robustness, stronger competitiveness. experimental on coal gangue dataset accuracy ISSA-SVM 7.09% 4.25% compared with SSA-SVM, respectively. Meanwhile, time for a single image frame reduced 20.15% 13.74%

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improvement in Support Vector Machines Algorithm with Imperialism Competitive Algorithm for Text Documents Classification

Due to the exponential growth of electronic texts, their organization and management requires a tool to provide information and data in search of users in the shortest possible time. Thus, classification methods have become very important in recent years. In natural language processing and especially text processing, one of the most basic tasks is automatic text classification. Moreover, text ...

متن کامل

An Improved Decomposition Algorithm for Regression Support Vector Machines

A new decomposition algorithm for training regression Support Vector Machines (SVM) is presented. The algorithm builds on the basic principles of decomposition proposed by Osuna et. al ., and addresses the issue of optimal working set selection. The new criteria for testing optimality of a working set are derived. Based on these criteria, the principle of "maximal inconsistency" is proposed to ...

متن کامل

An Improved Training Algorithm for Support Vector Machines

We investigate the problem of training a Support Vector Ma chine SVM on a very large date base e g data points in the case in which the number of support vec tors is also very large e g Training a SVM is equiva lent to solving a linearly constrained quadratic programming QP problem in a number of variables equal to the num ber of data points This optimization problem is known to be challenging ...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Optimizing F-Measure with Support Vector Machines

Support vector machines (SVMs) are regularly used for classification of unbalanced data by weighting more heavily the error contribution from the rare class. This heuristic technique is often used to learn classifiers with high F-measure, although this particular application of SVMs has not been rigorously examined. We provide significant and new theoretical results that support this popular he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3234579